Routing Dependable Connections With Specified Failure Restoration Guarantees in WDM Networks - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

Absnocr--This paper considers the problem of dynamically establishing dependable connections ( D c ~ ~ ~ t i ~ n s ) with peci6ed failure restoration guarantees in wavelength-routed wavelength-division multiplexed (WDM) networks. We call a connection with fault tolerant requirements as a D-connection. We recommend using a pro-active approach to fault tolerance wherein a D-connection is identifled with the establishment of a primary and a backup lightpath at the time of honoring the connection request, However, the backup lightpath may not be available to a connection throughout its existence. Upon occurrence ot a fault, a failed connection is likely to find its backup path available with a certain spedfied guarantee. We develop algorithms to select routes and wavelengths to establish Dconnections with speCiried failure restoration guarantees. The algorithms BIP based on a technique called primary-backup multipluing. We present an &dent and computationally simple method to estimate the average number of connections per link for which the backup paths are not readily available upon occurrence of a link failure. This meamre is used for selecting suitable primary and backup lightpaths for a connection. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed algorithms on different networks. The results show that the blocking performance gain is attractive enough to allow some reduction in guarantee. In particular, under the tight load conditions, more than 90% performance gain is achieved at the expense of less than 10% guarantee redU&OR